System and method for the detection of processing hot-spots

ABSTRACT

A system and method for the storage, within one or more virtual execution context registers, tracing information indicative of process/code flow within a processor system. This stored information can include a time stamp, information indicative of where the instruction pointer of the system was pointing prior to any process discontinuity, information indicative of where the instruction pointer of the system was pointing after any process discontinuity, and the number of times a specific instruction or sub-process is executed during a particular process. The data collected and stored can be utilized within such a system for the identification and analysis of processing hot-spots.

BACKGROUND OF THE INVENTION

In the field of microprocessor system architecture and design, maximizing the utilization of the processing capabilities of a given processor core is a crucial with respect to the performance and productivity of a computing system. One of the most widely utilized approaches to accomplish this goal is the utilization of microprocessor systems that employ simultaneous multithreading (“SMT”) an architecture that enables a single core to intelligently process two separate tasks or “threads” simultaneously.

FIG. 1A provides a simplified representation of a single-core microprocessor system 100 that utilizes SMT. As shown, in a first configuration core logic 102 is switchably linked (104) to register grouping A (106) and data path 108. Register grouping A stores instructions and data defining a first processor state for microprocessor system 100. Core logic 102 then utilizes its internal resources (e.g., Adder, Arithmetic Logic Unit) to process instructions and data, acquired from register grouping A, and returns results of the processing to register grouping A via data path 110. As internal resources within core logic 102 become available to accept instructions and data from register grouping B (112) (a condition that can occur while other internal resources of core logic 102 are still processing the instructions/data acquired from register grouping A), core logic is switchably linked (104) to register grouping B (112) (see FIG. 1B). register grouping B stores instructions and data defining a second processor state for microprocessor system 100. As shown, in this second configuration, core logic 102 is linked (104) to register grouping B (112) and data path 114 to permit the fetching of instructions and data from register grouping B. The available internal resources of core logic 102 can then process the instructions and data acquired from register grouping B (returning processing results to register grouping B via data path 116). The selective utilization of Register groupings A and B by single-core microprocessor system 100 enables the internal resources of core logic 102 to appear to be simultaneously processing instructions and data acquired from both register groupings (simultaneous multithread processing).

Although SMT processing enables a single physical processor to perform as if there were two separate logical processors within the microprocessor system, SMT is still constrained by the physical limitations of the associated register groupings (register groupings A and B in the above example). Within a given microprocessor, these associated register groupings are physical register groupings fabricated within the same monolithic semiconductor structure as the core logic. These physical register groupings have a fixed size and structure that dictate the amount of data that may be stored within them, and the manner in which such data can be stored and/or accessed. These register groupings are fixed, physical semiconductor structures within the microprocessor and cannot be modified or reconfigured. In addition, the processor's instruction set which defines how these fixed register groupings are addressed and accessed is also static, and cannot be reconfigured or altered.

The physical register groupings within modern microprocessors can each consist of a large number of individual registers. These sizable register groupings, combined with the static nature of the instruction for accessing the register groupings, typically result in a significant number of clock cycles being required for a given set of instructions or data to be acquired from the register grouping architecture and provided to a logic core. The larger the register grouping, the greater the possible clocking delay and consequential loss of processor efficiency.

Consequently, there exists a need for a system and method that provides the ability, at run-time, to dynamically define the configuration, capacity, and other aspects of the register files associated with one or more logic cores, and to provide the proper context to enable any associated logic core to access and execute the information contained in the dynamic register files, thereby achieving increased processing speed and efficiency.

BRIEF SUMMARY OF THE INVENTION

A system and method for the storage, within one or more virtual execution context registers, tracing information indicative of process/code flow within a processor system. This stored information can include a time stamp, information indicative of where the instruction pointer of the system was pointing prior to any process discontinuity, information indicative of where the instruction pointer of the system was pointing after any process discontinuity, and the number of times a specific instruction or sub-process is executed during a particular process. The data collected and stored can be utilized within such a system for the identification and analysis of processing hot-spots.

BRIEF DESCRIPTION OF THE DRAWINGS

The aspects, and advantages of the present invention will become better understood with regard to the following description, appended claims, and accompanying drawings in which:

FIG. 1A is a simplified functional diagram of a single core microprocessor SMT system in a first configuration.

FIG. 1B is a simplified functional diagram of system of FIG. 1A in a second configuration.

FIG. 2 is a functional block diagram of a processor and memory arrangement supporting a preferred embodiment of a system and method utilizing dynamic register files.

FIG. 3 is a functional block diagram of logical processor and memory arrangement supporting a preferred embodiment of a system and method utilizing dynamic register files.

FIG. 4 is a functional block diagram of a system of multiple logical processors and a memory arrangement supporting an alternate preferred embodiment utilizing dynamic register files.

FIG. 5A is a functional block diagram of a virtual processor system and memory arrangement supporting an additional preferred embodiment utilizing dynamic register files.

FIG. 5B is a functional block diagram of an alternate virtual processor system and memory arrangement supporting yet another preferred embodiment utilizing dynamic register files.

FIG. 6 is a functional block diagram of a virtual processor system and memory arrangement enabling software-controlled processor customization.

FIG. 7 is a functional block diagram of a set of registers supporting the storage of context tracing information.

DETAILED DESCRIPTION

FIG. 2 is a functional block diagram of a processor and execution memory system (200) supporting a preferred embodiment of a system and method utilizing dynamic register files. As shown, system 200 consists of processor 202 and virtual execution context memory 204. Processor 202 includes base register contexts 206, register context pointer 208, memory context pointer 210, configuration register 212. Virtual execution context memory 204 is defined by software in a configurable random-access memory storage system, such as a DRAM or SRAM. The execution context memory stores information indicative of a register context (214) and an associated or paired memory context (216). Register context information 214 can include information typically associated with defining a processor state (i.e., processing a given thread), such as constant registers 218, parameter registers 220, reference registers 222, general purpose registers 224 and local process registers 226. Similarly, memory context information 216 within execution context memory 204 can include information such as variable storage information 228 and environment chain information 230.

The functionality of the system depicted in FIG. 2 is similar to that of the system depicted in FIGS. 1A and 1B, in as much as the information stored in virtual execution context memory 204 defines the state of processor 202. However, there are numerous critical advantages offered by system 200. For example, virtual execution context memory 204, being a software-defined construct within RAM is not comprised of fixed physical registers fabricated within a monolithic semiconductor structure housing a fixed core logic. Rather, execution context memory 204 is configured to have precisely enough capacity to contain the register context information 214 and paired memory context information 216 that define a given state of processor 202. “Right-sizing” the amount of RAM allocated for each of the associated registers, variable storage and/or environmental chains to define and support a particular state of processor enables the information contained in virtual execution context memory 204 to be accessed very efficiently. This right-sizing can be performed at run-time so as to dynamically define the amount of memory within the configurable random-access memory storage system designated for each of the registers, chains and variable stores within execution context 204.

For example, if defining a particular processor state required 1 Mbytes of parameter register context information 214, then IM byte of space within random-access memory storage system would be designated for that purpose. Similarly, if 256 Kbytes of memory context information 216 was required to define a particular processor state, then 256 Kbytes of RAM would be designated for that purpose within virtual execution context memory 204. This permits processor 202 to access requisite information from execution context memory 204 without the inherent inefficiency introduced by a fixed physical register structure that is likely to have a capacity far in excess of what is required to support the register context information (214) or memory context information (216) required to define a particular processor state.

Register context pointer 208 within processor 202 provides the particular RAM address at which the register context information is stored. Similarly, processor 202's memory context pointer 210 provides the particular RAM address at which the memory context information is stored. The requisite context information is efficiently retrieved and processed, enabling processor 202 to efficiently assume a defined state and process an associated thread. This direct access of right-sized execution context information also permits processor 202 rapidly switch between one state or thread and another, offering greatly improved processor efficiency when compared to a conventional fixed register processor architecture.

The system and method disclosed above offer an additional advantage over conventional, fixed-in-silicon core and register processor architecture. In such conventional processor architecture, the stored memory context information relates to the entire platform. If such platform-wide information were to be breached, it could provide a basis for platform-wide unauthorized access and the compromising of all of the information associated with the platform. Contrastingly, the disclosed system and method utilize context pointers within a logical processor. These context pointers (register context, memory context, etc.) are not accessible outside of the execution context in which they reside. Furthermore, each pointer only provides direction to a specific RAM location and would not provide any indicia useful in attaining unauthorized platform-wide access. There is simply is no platform-wide information stored within the base registers. In fact, the architecture in the system described above fails to even have a platform that could be viewed as analogous (and therefore as vulnerable) to the physical semiconductor structure upon which present microprocessor technology is typically fabricated.

Processor 202 can be a processor utilizing a single core system (similar to the processor depicted in system 100 of FIGS. 1A and 1B), or a processor employing a multi-core architecture. Each of the cores being capable of utilizing SMT or a similar strategy to perform as two or more logical processors, wherein the state of a given a logical processor would be defined by the accessed register context information and memory context information. A functional block diagram of one such multi-logic core system (300) is illustrated in FIG. 3. As shown, system 300 includes six logical processors (302-312) configured to access virtual execution context memory 314. These logical processors each include base register context information (316-326), which although critical to the operation of processor 202, typically reside outside of the physical package housing the processors logic core(s) so as to enable them to be utilized by other active execution processes.

Each of the logical processors (302-312) respectively accesses one pair of register context information 328-338 and memory context information 340-350 within virtual execution context memory 314. The logical processors then each execute the thread defined by the respective paired register and memory context information. As internal resources within a logical processor become available to accept instructions and data associated with a different thread, the logical processor can access alternate register and memory context information pairs within virtual execution context memory 314. For example, assume that resources within logical processor 302 become available after completing the processing of a thread that was defined by register context information 328 and memory context information 340. Virtual processor 302 could then be utilized to execute a thread defined by accessing register context information 330 and memory context information 342.

As previously stated, the paired register context and memory context information is stored within RAM, and consequently it will be understood that that the number of such pairings is limited only by the size of the available RAM. FIG. 4 provides a functional block diagram of a system (400) wherein virtual execution context memory 402 includes paired register and memory context information 408 through 4 nn. These right-sized register and memory context pairings define a different processor state for processing a particular thread. Each of the register and memory context pairings is accessible by any one of logical processors 402-4 mm, utilizing register and memory context pointer information stored within each logical processor. This enables any available resources within any one of the six logical processors to assume the state and execute the thread defined by any one the of the register and memory context pairings stored within virtual execution context memory 402.

An additional embodiment of the above system and method utilizes a virtual processor in conjunction with execution context memory. As shown in FIG. 5A, virtual processor system 500 a is similar to the system depicted in FIG. 2. Virtual execution context memory 504 is a software-defined construct within RAM and configured at the initial run-time of a given process or program to have precisely enough capacity to contain the register context information 514 and paired memory context information 516 required to support the operations that will be executed over the entirety of the given process/program. Register context pointer 508 provides the particular RAM address at which the register context information is stored, and memory context pointer 510 provides the particular RAM address at which the memory context information is stored. However, unlike the system of FIG. 2, the processor (502) in which these context pointers reside is a virtual processor. Virtual processor 502 is comprised of information indicative of a register context pointer (508), a memory context pointer (510). Virtual processor 502 can also include other configuration register information (512) required to specify a given virtual processor state, as well as virtual processor identification information (518), which would serve to distinguish between individual virtual processors in systems employing multiple virtual processors. As with the virtual execution context information (514) of system 50 a, the information comprising virtual processor 502 is stored within RAM (see FIG. 5B). The processor is effectively virtualized in a manner similar to that of a thread or processor state, and the virtual processor information is processed one or more logic cores as assets become available. In the system (500 b) depicted in FIG. 5B, the information representing the virtual processor can be stored within the same RAM (520) utilized for storage of the virtual execution context information.

In all of the systems and methods that have been described, the state and configuration of the processor (be it virtual or otherwise) is defined at the run-time of a given process or program. That is, the number and types of registers, as well as the resources to support the requisite memory context, are defined so that the operations executed over the entirety of the given process/program will be supported. Although this specification of these resources is can be viewed as dynamic as it is a function of the particular resource requirements for a specific process/program, and will be redefined prior the execution of a new process/program by the virtual processor, the definition remains static throughout the execution of any given process or program.

The embodiment of the invention illustrated in FIG. 6 provides for a system and method wherein the particular resources supporting a process/program are dynamically adjusted to accommodate the workload at any given point within a process/program. This effectively changes the very geometry of the virtual processor executing a process/program as a function of processor workload, thereby enabling execution efficiency and security to be further optimized.

As shown, in FIG. 6, a system 600 includes virtual processor 602 and execution context memory 604. Virtual processor 602 is comprised of information indicative of a compiler (608), register context pointer (610), a memory context pointer (612). Virtual processor 602 may also include other configuration register information (614) required to specify a given virtual processor state, as well as virtual processor identification information (616), which would serve to distinguish between individual virtual processors in systems employing multiple virtual processors. Virtual execution context memory 604 is a software-defined construct within RAM and includes register context information 618 and paired memory context information 620 which support the operations that will be executed during a given process/program. The primary operation and interaction of the various components of system 600) are similar to the like-named components of system 500 b (FIG. 5B). However, system 600 employs a compiler adapted to determine the precise number and size of the register resources required to support each instruction in the stream of instructions that comprises a given process/program. Compiler 608 is a software construct adapted to interpret a language source code, and emits a code file comprised of machine code targeted for a specific execution environment. The compiler can be resident in the same system that supports virtual processor 602 and/or execution context memory 604, or be supported by a wholly separate system.

The compiler in system 600 operates to provide a code file defining the specific execution environment for virtual processor 502. This code file would include at least one base instruction set (“IS 0”), enabling the initialization of the virtual processor. Compiler 608 is further adapted to provide one or more additional instruction sets so as to configure virtual processor 602 to support both fixed length (622) and/or variable (624) length virtual execution registers. As the compiler processes each instruction, it computes the optimal number, type and size of the registers required to support and execute that particular instruction, or subset of instructions comprising a given execution context with the overall process/program.

In a first embodiment, system 600 is utilized to allocate a set of fixed registers as a function of particular individual instructions within a given execution context. This could be implemented as a function of a single parameter indicative of the number of static registers to be allocated. In this embodiment, all registers are of a uniform size, and therefore the size is inherently known. So, an instruction could for example allocate 64 static registers, starting at register offset 00, and being continuous through register 63. These 64 registers remain allocated until the termination of the execution context. In a 32-bit processor system, the register width would most likely be 32 bits; in a 64-bit processor system, the register width would most likely be 64 bits.

System 600 could also be adapted to allocate multiple types of registers on the basis are allocated on the basis of particular individual instructions within a given execution context. As shown in FIG. 6, these registers can include general-purpose registers, constant registers, parameter registers, and reference registers. This allocation can be executed on the basis of an instruction comprised of a single parameter, A=15. This parameter would be interpreted by system 600 as specifying the allocation of 15 general purpose registers, 15 constant registers, 15 parameter registers, and 15 reference register. This makes for a compact and efficient instruction, but runs the risk of wasting register space for the register types that do not require the maximum count of 15.

An alternate methodology could employ an instruction having a more complex structure and specify the allocation use a form of A=(20, 50, 12, 30). This would be indicative of the allocation 20 general purpose registers, 50 constant registers, 12 parameter registers, and 30 reference registers. Each of these registers would be of identical width.

Yet another instruction schema suitable for use with system 600 supports the allocation of registers having unequal widths. For example, assume system 600 has a somewhat limited address space, but the capability to support large numeric representations. In such in architecture the width of a general-purpose registers, constant registers, and parameter registers would be large, such as 128 bits, while the reference registers storing addresses would be a more modest 32 bits. An allocation instruction of the form A=[(20, 128), (50, 128), (12, 128), (30, 32)] would result in the allocation of 20 128-bit general purpose registers, 50 128-bit constant registers, 12 128-bit parameter registers, and 30 32-bit reference registers. This amount of memory required to hold each register type being dictated by the register type itself. This optimizes the memory allocation for the register set, as the byte offsets to the registers can be easily calculated from the register number and register type, and maintains a consistent instruction set register numbering scheme across all register types.

The allocation instruction could also be of a format that specified the register width along with the register type, so as to provide an even more dynamic and flexible use of register memory. For example, many machine learning programs utilize a 16-bit arithmetic width to support high-speed calculations while sacrificing a certain degree of accuracy. In executing such a program, an architecture could be allocated to permit general-purpose, constant, and parameter registers to be of varying widths. An allocation instruction of A=[[(20 64), (20 16)], [(25 64), (25 16)], (12 64), (30 64)] would be indicative of the following register configuration:

-   -   20 64-bit general purpose registers;     -   20 16-bit general purpose registers;     -   25 64-bit constant registers;     -   25 16-bit constant registers;     -   12 64-bit parameter registers; and     -   30 64-bit reference registers.         The specific execution context supported by the specified         registers being precisely configured for the machine learning         task at hand.

An alternate allocation command sequence of four separate instructions wherein each one specified type, quantity and width of the requisite registers could also achieve the same end result. For example:

-   -   A=0 20 64, 0 20 16;     -   A=1 25 64, 1 25 16;     -   A=2 12 64; and     -   A=3 30 64.         In this instruction format, the first number of the ASRS         instruction delineates the type; 0=General Purpose, 1=Constant,         2=Parameter, 3=Reference.

It should also be understood that although the register allocation systems, parameters and processes described above were focused upon providing the allocation of particular registers having a type and a size (width) based primarily upon optimizing the execution of particular instructions within a given execution context, the inherent security aspects provided by such are significant. The very nature of the register allocation system and processes discussed above is dynamic in the time domain. Any state or information available at a given time is transient. An external entity observing or accessing this dynamic system (perhaps without permission) would be observing what would appear to be an unstable system, presenting information that appeared to vary randomly in size and location. Without the proper context for a given state of the dynamic system (which would be wholly unavailable to an unauthorized third party), the information would likely yield little or no discernable intelligence with respect to the process being executed. The inherent security aspects of this dynamism are obvious. Consequently, utilization of such a system could be motivated in whole or in part by the provision of a secure virtual environment for the execution of particularly sensitive or private processes.

The inherent security afforded by the transient and context-specific nature of the register allocation described above can be leveraged to provide increased security for information beyond the bounds of the data that is traditionally stored in processor registers. Typically, processor registers are used primarily for data, as opposed to instruction code. Although there is an instruction pointer in conventional processor register systems, this pointer typically provides a platform memory address at which the processor (physical or virtual) can prefetch a limited number of code bytes which can then be decoded, scheduled, and executed. The large register set afforded by the architecture and processes disclosed above makes it feasible to store significant portions, or even the entirety, of private instruction code in the register domain. This here-to-fore unavailable departure from traditional processor design benefits from the security provided by the registers within the execution context. Code stored within such is not visible to any entity or process other than the particular program which is associated with the execution context. This makes having the ability to direct the instruction pointer to a register address internal to the processor register set, as opposed to an address within a platform memory, a significant enhancement for the protection of critical data such as instruction code and/or encryption keys. The capability for the processor to take instructions linearly from a contiguous set of internal registers, and to freely switch from code in memory to code in registers, and back again, brings a new, enhanced level of capability to compilers to further optimize processor architecture and state for a given workload or task.

For example, in a particular embodiment, the compiler (608) would be utilized to recognize particular code as representing instructions, or sets of instructions, that should be afforded an elevated level of security. Upon recognition of such, the compiler would responsively create code bytes representing the particular code (in accordance with a predetermined algorithm) and store such within the execution context registers (618). This recognition could be based upon a predetermined set of parameters, or upon a marker within the particular code. Once the created code bytes were resident within the execution context registers, the compiler would be adapted to utilize the code bytes as process instructions. This morphing of the information stored within the execution register(s) from data to executable code can be characterized as a self-modifying code, wherein the initial code relies upon other private registers to control the code modifications. The transient nature of code bytes stored in the execution context registers, in conjunction with the predetermined algorithm utilized by the compiler to create the code bytes would serve to make reverse engineering, or otherwise attempting to compromise the store code bytes extremely difficult for any unauthorized party that lacked the contextual information necessary to properly recognize and interpret the code bytes. Thus, the instant invention enables a compiler to not only optimize processor performance, but also optimize a process' or program's security.

One manner of constructing the value of the pointer referencing the instruction code within the execution context memory utilizes a form of [Area Descriptor (“AD”)+offset]. This [AD+offset] structure provides for further enhancing the security of the instruction code. The AD describes a register area, but the actual physical address is hidden from the application layer. The instructions leverage the physical address during execution, but the programs themselves have no way of knowing where they are located. Their knowledge is limited to their offsets within a segment. Without knowledge of where the base of the segment is, one cannot discern what the addresses spanned by the area descriptor are. This model is valid even when the pointer is referencing code within internal registers as described above. In this case, the AD refers to the case of the segment containing the memory in which the registers containing the code are embodied. In both cases, a simple reference is suitable to describe the Instruction Pointer.

The emerging technology of vertically-integrated flash memory, also known as three-dimensional cross-point or 3D X-Point memory, which because if it's memory density and speed presents a particularly attractive environment for the storage of private instruction code in the register domain. This type of memory also offers the advantage of non-volatile storage of information, thereby provides an area of persistent private memory which can be allocated like any other register file data, but which will be provide for the persistent and secure storage of information (instruction code). Although the storage is persistent, it remains available only to the process which is executing within the confines of this specific processor. This provides a significant enhancement for the generation, storing, and retrieval of encryption keys and instruction code. As described above, a non-volatile 3D X-point memory could serve as a secure private disk which can only transfer data to/from the secure register file accessible only within a particular process environment. In order to prevent unauthorized restoration of a preserved key-value pair, higher levels of software could be required to assure that the act of requesting restoration, has been validated via guiding principles of a given implementation.

The disclosed embodiments can be further adapted to enable the creation and storage of information indicative of the code flow, also known as process tracing information. As shown in FIG. 7, the storage of such information is supported by a set of registers (702) within execution context memory (604). Ideally, such registers (704, 706, 708 . . . 7 nn) would typically be organized in a circular fashion, so once sequential utilization of the registers exhausted all (7 nn-704) registers, the next process tracing information would be stored in register 702. In a particular embodiment, only context information related to non-sequential advancement of an executing process is stored (such discontinuities can be indicative of an exception in a process flow, such as an error or an interrupt).

Typically, the set of registers (702) would consist of a large number of individual registers, on the order of thousands, each dedicated to and adapted for the storage of three types of information associated with a given captured process step. The first is a timestamp (“t_(d)”) which provides a temporal context for the particular process step to which the register relates. The second is data indicative of the where the instruction pointer of the processor system was directed to prior to any discontinuity. The third is data indicative of where the instruction pointer was directed to after its discontinuity. The register would also have to include information identifying the particular process in which the discontinuity occurred (“PID”), as any given processor could be responsible for the execution of multiple independent processes. The large number of registers is desirable as the stored context flow information needs to be able to provide a significant amount of execution history for an active execution context so as to permit a diagnosis of code flow to be determined. More registers translates to more information, and a recordation of a longer period of processing time. As a consequence of storing the context tracing information in a dedicated series of registers, the system can capture of the needed data at processor speeds, and with minimal performance impact upon process execution. Physical register embodiments will likely have a speed advantage over virtual embodiments, as the virtual registers would likely be embodied within platform memory, as opposed to high-speed ram. Contrastingly, virtual embodiments would likely exhibit an advantage with respect to the depth (time window) of a trace, as platform memory can be typically be scaled with far greater ease than memory located within a physical processor.

When multiple activation contexts each have code flow information being captured, it makes certain classes of problems easier to diagnose. For example, the process of servicing a web request may traverse a large number of execution contexts as different software pieces (browsers, web servers, restful services, load balancers, etc.) become involved in the decoding of the request and the generation of an associated response. If all of these execution contexts reside in the same processor, all of the timestamps will correlate across the entire sequence of events, thus providing the contextual information needed to aid in making a determination as to the cause of an exception.

Another application for code flow capture is the enablement of profile-guided optimization (“PGO”) of the compiler/compilation process. Although this technology is known in art, it is typically supported via an instrumentation phase wherein a specialized version of the code to be profiled is heavily modified in order to enable the recording of all branches taken within the program. This can result in an enormous performance penalty, requiring hours where only minutes are required in a non-instrumented enablement, such as that provided by the invention. In addition, typical PGO is not a truly dynamic analysis of the subject code, as the modification of the code to enable the analysis inherently alters the performance, and therefore prohibits the collection of information reflective of the actual process performance.

The code flow data is accumulated, and the process is configured to generate an interrupt when the circular buffer (702) is full. At such a juncture an interrupt service routine can be provided to request a block move of the captured data to an alternate memory context, and perhaps the eventual storage within a persistent memory, such as a disk. These block moves occur at what is essentially memory speed, without the interruption of the process execution flow. When the execution context terminates, the final data is moved to memory and/or persisted to disk. This data collection file is then input to the compiler for it to consume and determine what optimizations can be done to the code file in order to optimize the most frequently traversed paths.

Code flow capture can also be employed to detect so called hot-spots; that is the identification of the instructions or sub-processes that are taking up a significant portion of the processing time expended upon a given process. To identify a hot-spot, a register space is created for recording the number of times a specific, identifiable code location occurs within a process. Each such identifiable code is associated with a particular register space in which a value representative of a monotonic counter that is incremented every time the associated code location is encountered. When the execution completes, the results are harvested from the counter registers. Those with the highest count values would be indicative of process hot-spots.

Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. For example, any of the embodiments described above could utilize a compiler that employs a particular scheme known as static single assignment “SSA”). SSA assigns an intermediate value to represent each variable being dealt with, which in the case of the disclosed embodiments would be the parameters defining the requisite registers for representation of any given private code. While the assignment of an intermediate value, which itself would be stored in a register or registers dedicated for such, may appear wasteful, the approach provides some simplification for the compiler and enhanced security for the emitted code, at the cost of a larger register footprint.

The invention could be also implemented utilizing a variety of physical topologies and circuitry. It could be implemented in a monolithic architecture, or across a number of interconnected discrete modules or circuit elements, including elements linked by means of a network. 

1. A system for the recognition of processing hot-spots comprising: a plurality of addressable virtual registers, wherein each of the addressable virtual registers stores code indicative of an individual process step; a plurality of code execution registers, each dedicated to the storage of information related to a particular individual process step; and at least one processor adapted to: execute at least one process comprising the sequential execution of the identifiable process steps as indicated by the code stored within the plurality of addressable virtual registers, record the number of times, within the execution of the at least one process, a particular identifiable process step, as indicated by the code stored within the plurality of addressable virtual registers, is executed; store a value indicative of the number of times a particular identifiable process step is executed in a particular one of the plurality of code execution registers dedicated to the particular identifiable process step; and classify a particular identifiable process step as a process hot-spot based, at least in part, upon the stored value indicative of the number of times a particular identifiable process step is executed.
 2. The system of claim 1 wherein recording the number of times, within the execution of the at least one process, a particular identifiable process step, as indicated by the code stored within the plurality of addressable virtual registers, is executed comprises increasing a monotonic counter.
 3. The system of claim 1 wherein the plurality of code execution registers comprises at least one of the following: a virtual memory; and a physical memory.
 4. The system of claim 1 wherein the at least one processor comprises at least one of the following: a physical processor; and a virtual processor.
 5. The system of claim 1 wherein the plurality of addressable virtual registers comprises a virtual context memory.
 6. The system of claim 5 wherein the virtual execution context memory comprises at least one of the following: static random-access memory; dynamic random-access memory; a non-volatile memory; and a three-dimensional cross-point memory.
 7. A method for the for the recognition of processing hot-spots; in a system comprising: a plurality of addressable virtual registers, wherein each of the addressable virtual registers stores code indicative of an individual process step; a plurality of code execution registers, each dedicated to the storage of information related to a particular individual process step; and at least one processor adapted to: execute at least one process comprising the sequential execution of the identifiable process steps as indicated by the code stored within the plurality of addressable virtual registers; the method comprising the steps of: recording the number of times, within the execution of the at least one process, a particular identifiable process step, as indicated by the code stored within the plurality of addressable virtual registers, is executed; storing a value indicative of the number of times a particular identifiable process step is executed in a particular one of the plurality of code execution registers dedicated to the particular identifiable process step; and classifying a particular identifiable process step as a process hot-spot based, at least in part, upon the stored value indicative of the number of times a particular identifiable process step is executed.
 8. The method of claim 7 wherein the step of recording comprises increasing a monotonic counter.
 9. The method of claim 7 wherein the plurality of code execution registers comprises at least one of the following: a virtual memory; and a physical memory.
 10. The method of claim 7 wherein the at least one processor comprises at least one of the following: a physical processor; and a virtual processor.
 11. The method of claim 7 wherein the plurality of addressable virtual registers comprises a virtual context memory.
 12. The method of claim 11 wherein the virtual execution context memory comprises at least one of the following: static random-access memory; dynamic random-access memory; a non-volatile memory; and a three-dimensional cross-point memory. 